Anaphora and Ellipsis in Type-Logical Grammar
نویسنده
چکیده
The aim of the present paper is to outline a unified account of anaphoricity and ellipsis phenomena within the framework of Type Logical Categorial Grammar.1 There is at least one conceptual and one empirical reason to pursue such a goal. Firstly, both phenomena are characterized by the fact that they re-use semantic resources that are also used elsewhere. Secondly, they show a striking similarity in displaying the characteristic ambiguity between strict and sloppy readings. This supports the assumption that in fact the same mechanisms are at work in both cases.
منابع مشابه
Anaphora and Quantification in Categorial Grammar
The paper proposes a type logical reformulation of Jacobson’s ([9]) treatment of anaphoric dependencies in Categorial Grammar. To this end, the associative Lambek Calculus is extended with a new connective. In the first part, its proof theory is introduced and the logical properties of the resulting calculus are discussed. In the second part, this system is applied to several linguistic phenome...
متن کاملA Unified Approach to VP-ellipsis and VP-anaphora
It is known that VP-ellipsis and VP-anaphora are typologically different phenomena. English has VP-ellipses whereas Korean has VP-anaphora. The goals of this paper are (i) to develop a unified algorithm which can analyze these two different phenomena and (ii) to explain them using the developed resolution algorithm. In order to analyze these phenomena, this paper incorporates Jäger (2010)’s ana...
متن کاملA Hybrid Type of Ellipsis in Romanian
The paper presents a type of ellipsis similar to stripping and split conjuncts, yet irreducible to either of them. One aim of the analysis is to document the existence of this distinct ellipsis type within the class of constructions where the elided constituent is a verb or a verb phrase. It is argued that the main generative strategies, namely, deletion and null anaphora cannot be applied to t...
متن کاملAnaphora Resolution in Slot Grammar
We present three algorithms for resolving anaphora in Slot Grammar: (1) an algorithm for interpreting elliptical VPs in antecedent-contained deletion structures, subdeletion constructions, and intersentential cases; (2) a syntactic filter on pronominal coreference; and (3) an algorithm for identifying the binder of an anaphor (reflexive pronoun or the reciprocal phrase "each other"). These algo...
متن کاملA compositional account of VP ellipsis
We present an approach to VP ellipsis that allows the direct derivation of source and target sentences (the former need not be unique) during semantic construction. Specific syntactic constituent structures are associated with ellipsis potential, which can then be discharged by pro-verbs like did (too). The determination of source and target sentence, which is done with semantic features in an ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997